Hierarchical Singular Value Decomposition of Tensors
نویسنده
چکیده
منابع مشابه
Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملA Randomized Tensor Train Singular Value Decomposition
The hierarchical SVD provides a quasi-best low rank approximation of high dimensional data in the hierarchical Tucker framework. Similar to the SVD for matrices, it provides a fundamental but expensive tool for tensor computations. In the present work we examine generalizations of randomized matrix decomposition methods to higher order tensors in the framework of the hierarchical tensors repres...
متن کامل3D Image Representation through Hierarchical Tensor Decomposition, Based on SVD with Elementary Tensor of size 222
As it is known, groups of correlated 2D images of various kind could be represented as 3D images, which are mathematically described as 3 rd order tensors. Various generalizations of the Singular Value Decomposition (SVD) exist, aimed at the tensor description reduction. In this work, new approach is presented for 3 rd order tensor decomposition, where unlike the famous methods for decompositio...
متن کاملHierarchical Decomposition of 2D/3D Images, Based on SVD 2×2
The famous Singular Value Decomposition (SVD) is very efficient in the processing of multidimensional images, when efficient compression, and reduction of the features, used for objects recognition, are needed. The basic obstacle for the wide use of SVD is its high computational complexity. To solve the problem, here is offered the new approach for hierarchical image decomposition through SVD (...
متن کاملBest subspace tensor approximations
In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained via the singular value decomposition which allows to compute the best rank k approximations. For t-tensors with t > 2 many generalizations of the singular val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 31 شماره
صفحات -
تاریخ انتشار 2010